Upper and lower bounds for the average-case complexity of path-search

Networks ◽  
1999 ◽  
Vol 33 (4) ◽  
pp. 249-259 ◽  
Author(s):  
Nicholas Pippenger
1995 ◽  
Vol 05 (02) ◽  
pp. 275-280 ◽  
Author(s):  
BEATE BOLLIG ◽  
MARTIN HÜHNE ◽  
STEFAN PÖLT ◽  
PETR SAVICKÝ

For circuits the expected delay is a suitable measure for the average case time complexity. In this paper, new upper and lower bounds on the expected delay of circuits for disjunction and conjunction are derived. The circuits presented yield asymptotically optimal expected delay for a wide class of distributions on the inputs even when the parameters of the distribution are not known in advance.


2018 ◽  
Vol 28 (4) ◽  
pp. 201-221
Author(s):  
Aleksandr V. Chashkin

Abstract The average-case complexity of computation of underdetermined functions by straight-line programs with conditional stop over the basis of all at most two-place Boolean functions is considered. Correct order estimates of the average-case complexity of functions with maximum average-case complexity among all underdetermined functions are derived depending on the degree of their determinacy, the size of their domain, and the size of their support.


1997 ◽  
Vol 26 (1) ◽  
pp. 1-14 ◽  
Author(s):  
Laurent Alonso ◽  
Edward M. Reingold ◽  
René Schott

Sign in / Sign up

Export Citation Format

Share Document